|
|
Effective Dynamic Programming in Bioinformatics
Franěk, Jaromír ; Hynek, Jiří (referee) ; Burgetová, Ivana (advisor)
Purpose of this thesis is to study principle of effective algorithms, that are using dynamic programming. Using this knowledge to create application demonstrating principle of effective algorithm of dynamic programming in bioinformatics and write a report summarizing results. Algorithms used in this thesis are solving DNA sequence alignment or RNA secondary structure prediction. These algorithms are compared between themselves based on different input values. For DNA sequence alignment are used algorithms such as Needleman-Wunch and X-drop. For prediction of secondary RNA structure is used Zuker algorithm, that should remove some of Nussin algorithm weaknesses and Nussin algorithm itself. Recursion is showed by recursion trees. Dynamic programming is showed by score matrix. User also have ability to compare speed of both approaches for given sequences. It is programmed as web application, that run on client's side. This ensure easy availability.
|
|
|
Graphics Intro 64kB Using Ray Tracing
Luňák, Miroslav ; Herout, Adam (referee) ; Jošth, Radovan (advisor)
This thesis is concerning the description of creation of graphic intro 64kB using ray tracing. The main focus is the problems and principles connected with the topic of the thesis. Further on, the thesis describes the actual realization of the application and the achieved results. The conclusion covers the evaluation of thesis and possible ways for further improvement of the project.
|
|
|
Non-Euclidian Geometries in Computer Games
Jůda, Štěpán ; Hůlka, Tomáš (referee) ; Dobrovský, Ladislav (advisor)
The work deals with the origin and description of non-Euclidean geometry and its division into hyperbolic and elliptic non-Euclidean geometry. It also discusses the behavior of geometric elements from Euclidean geometry in non-Euclidean geometries. Another subject of this work is the classification of computer games that use non-Euclidean geometry. The last point is the process of creating my own computer game.
|
|
|
Graphics Intro 64kB Using Ray Tracing
Dočkal, Jiří ; Chudý, Peter (referee) ; Herout, Adam (advisor)
This thesis is concerned with the description of the aplication which was determined by the assignment of the bachelor thesis. The main focus are the problems and principles connected with the topic of the thesis. Further on, the thesis describes the actual realization of the aplication and the achieved results. The conclusion covers the evaluation of thesis and possible ways for further improvement of the project.
|
|
|
Space Filling Curves
Staňo, Marek ; Švub, Miroslav (referee) ; Šiler, Ondřej (advisor)
The objective of my work is introduce space filling curves, and try to generalize them to multidimensional spaces. Below are in the work informations about recursive and non-recursive solving of these curves, and usage curves in practice. The main objective is to create program which can draw these curves. Based on theory and practical knowledge I design program, which can compute the coordinates of the curve, and another program which uses these coordinates to draw the curve. To make this I will use programming language C and graphics library Gd.
|
|
|
String Searching and Rekursive Algorithms in C Language
Porč, Jiří ; Lukáš, Roman (referee) ; Honzík, Jan M. (advisor)
The problem of finding a specified pattern in a text is one of the most frequently used tasks in the computers field. My work deals with the problems of searching and recursive algorithms. The objective of my work is to create programs for animated demonstration of selected algorithms and rewriting of the Study supporting materials for the course Algorithms into the C language. The created demonstrational programs are dealing with the problems of searching text strings in a text and recursion.
|
|
|
Recursive Web Search in KDE
Hefka, Lukáš ; Burgetová, Ivana (referee) ; Burget, Radek (advisor)
The bachelor thesis deals with problems related to web sites browsing from the KDE desktop environment. Part of this thesis is to introduce the application interface of this environment, suggestion description and application amplementation. The thesis supports range of restrictions both for searching area and searching itself. Application goes through the internet with the help of recursion and hypertext links. In conclusion there are descriobed application advatages in comparison with other alternative.
|
|
|
Generating Realistic Tree Models
Kučerňák, Martin ; Nečas, Ondřej (referee) ; Polok, Lukáš (advisor)
This thesis deals with generating realistic tree models. It describes briefly growth of trees and factors that influence growth. Next, it describes development of methods for tree generation, and describes few chosen methods. After that, simple stochastic method for generating trees is designed, and application, in which the method is implemented, is described. Trees created by this method are then compared with existing methods and aplications, and its qualities are discussed. Then areas with room for improvement are named.
|
|
|
Non-Euclidian Geometries in Computer Games
Jůda, Štěpán ; Hůlka, Tomáš (referee) ; Dobrovský, Ladislav (advisor)
The work deals with the origin and description of non-Euclidean geometry and its division into hyperbolic and elliptic non-Euclidean geometry. It also discusses the behavior of geometric elements from Euclidean geometry in non-Euclidean geometries. Another subject of this work is the classification of computer games that use non-Euclidean geometry. The last point is the process of creating my own computer game.
|
|
|
Machine-Free Characterization of Polynomially Computable Functions
Profeld, Michal ; Švejdar, Vítězslav (advisor) ; Verner, Jonathan (referee)
This work is focused into constructing mathematical structure. This structure is closed under it's operations. Structure was developed to contain all functions of certain growth rate. To be More specific functi- ons with polynomial growth rate. We can say that our structure con- tains all functions that have growth rate slower or equal to polynomial growth rate and no other function. Development of our structure was influenced mostly by work of Samuel R. Buss [1] 1
|
guest ::
